Definite Forms in a Finite Field
نویسندگان
چکیده
منابع مشابه
On Definite Quadratic Forms, Which Are Not the Sum of Two Definite or Semi-definite Forms
be a positive definite quadratic form with determinant D R and integer coefficients a ;Call it an even form if all a ; ; are even ., an odd form if at least one a ;; is odd . Then Í,, is called non-decomposable, if it cannot be expressed as a sum of two non-negative quadratic forms with integer coefficients . Mordell 1 ) proved that f, can always be decomposed into a sum of five squares of line...
متن کاملDefinite Quadratic Forms over Fq[x]
Let R be a principal ideal domain with quotient field F . An R-lattice is a free R-module of finite rank spanning an inner product space over F . The classification problem asks for a reasonably effective set of criteria to determine when two given R-lattices are isometric; that is, when there is an inner-product preserving isomorphism carrying one lattice onto the other. In this paper R is the...
متن کاملLevels of Positive Definite Ternary Quadratic Forms
The level N and squarefree character q of a positive definite ternary quadratic form are defined so that its associated modular form has level N and character Xg ■ We define ä collection of correspondences between classes of quadratic forms having the same level and different discriminants. This makes practical a method for finding representatives of all classes of ternary forms having a given ...
متن کاملSyntactic Complexity of Finite/Cofinite, Definite, and Reverse Definite Languages
We study the syntactic complexity of finite/cofinite, definite and reverse definite languages. The syntactic complexity of a class of languages is defined as the maximal size of syntactic semigroups of languages from the class, taken as a function of the state complexity n of the languages. We prove that (n − 1)! is a tight upper bound for finite/cofinite languages and that it can be reached on...
متن کاملA normal form for definite quadratic forms over Fq[t]
An efficient algorithm to compute automorphism groups and isometries of definite Fq [t]-lattices for odd q is presented. The algorithm requires several square root computations in Fq2 but no enumeration of orbits having more than eight elements.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1909
ISSN: 0002-9947
DOI: 10.2307/1988725